Control words of string rewriting P systems
نویسندگان
چکیده
منابع مشابه
On String Rewriting Systems
String rewriting systems, also known as semi-Thue systems, consist of a set of rules l → r, specifying valid replacements of substrings of strings over a given alphabet. In the case of one single rule, it is an open problem whether there is a system that is neither terminating nor looping. Another open question is the decidability of termination. Difficulties arise especially for non-confluent ...
متن کاملObservation of String-Rewriting Systems
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain a protocol of the entire process and then use this as the computation’s result. In a series of articles this approach has proved to often exceed greatly the power of the system observed. Here we apply this architectur...
متن کاملPeg - Solitaire , String Rewriting Systems
We consider a class of length-preserving string rewriting systems and show that the set of encodings of pairs of strings < s; f > such that f can be derived from s using the rewriting rules can be accepted by nite automata. As a consequence, we show the existence of a linear time algorithm for determining the solvability of a given k n peg-solitaire board, for any xed k. This result is in contr...
متن کاملOn Weakly Confluent Monadic String-Rewriting Systems
Madlener, K., P. Narendran, F. Otto and L. Zhang, On weakly confluent monadic string-rewriting systems, Theoretical Computer Science 113 (1993) 119-165. It is investigated as to how far the various decidability results for finite, monadic, and confluent string-rewriting systems can be carried over to the class of finite monadic string-rewriting systems that are only weakly confluent. Here a mon...
متن کاملString rewriting for double coset systems
In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not suffer this restriction and we present some examples of infinite double coset systems which can now easily be solved using our approach. Even when both enumerati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advances in Engineering Sciences and Applied Mathematics
سال: 2018
ISSN: 0975-0770,0975-5616
DOI: 10.1007/s12572-018-0222-0